quasirecognition by the prime graph of l_3(q) where 3 < q < 100

let $g$ be a finite group. we construct the prime graph of $ g $,which is denoted by $ gamma(g) $ as follows: the vertex set of thisgraph is the prime divisors of $ |g| $ and two distinct vertices $ p$ and $ q $ are joined by an edge if and only if $ g $ contains anelement of order $ pq $.in this paper, we determine finite groups $ g $ with $ gamma(g) =gamma(l_3(q)) $, $2 leq q < 100 $ and prove that if $ q neq 2, 3$, then $l_3(q) $ is quasirecognizable by prime graph, i.e., if $g$is a finite group with the same prime graph as the finite simplegroup $l_3(q)$, then $g$ has a unique non-abelian composition factorisomorphic to $l_3(q)$. as a consequence of our results we provethat the simple group $l_{3}(4)$ is recognizable and the simplegroups $l_{3}(7)$ and $l_{3}(9)$ are $2-$recognizable by the primegraph.